Earley parser
AN ALGORITHM FOR PARSING STRINGS THAT BELONG TO A GIVEN CONTEXT-FREE LANGUAGE
Earley Parser; Early algorithm; Earley Algorithm; Early Parser; Earley algorithm; Early parser; Early Algorithm; Earley's algorithm; Earley parsing; Parse forest
In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable grammars. The algorithm, named after its inventor, Jay Earley, is a chart parser that uses dynamic programming; it is mainly used for parsing in computational linguistics.